Network Synthesis with Non-simultaneous Single Commodity Flow Requirements
نویسنده
چکیده
This paper is dedicated to network synthesis problems with non-simultaneous single commodity ow requirements. An analysis of the complexity of these problems is presented, and new results are proposed. We mainly study the line restoration application since the multi-hour application was already widely covered in the literature. We concentrate on a particular case with uniform costs and requirements. First, we consider continuous capacities and then integer capacities. Some lower bounds and exact solutions for some classes of these problems are provided.
منابع مشابه
Synthesis of 2-Commodity Flow Networks
We investigate network design under volatile conditions of link failures and traffic overload. Our model is a non-simultaneous 2-commodity problem. We characterize the feasible solutions and using this characterization we reduce the size of the linear program. For 0/1 requirements we present a closed fractional optimal solution, a closed integer-capacities optimal solution, and 76 -approximatio...
متن کاملSynthesis of 2 - Commodity Flow
We investigate network planning and design under volatile conditions of link failures and traac overload. Our model is a non-simultaneous 2-commodity problem. We characterize the feasible solutions and using this characterization we reduce the size of the LP program. For the case that all non-zero requirements are equal we present a closed fractional optimal solution, a closed integer (where th...
متن کاملInteger Network Synthesis Problem for Hop Constrained Flows
Hop constraint is associated with modern communication network flows. We consider the problem of designing an optimal undirected network with integer-valued edge-capacities that meets a given set of single-commodity, hop-constrained network flow value requirements. We present a strongly polynomial, combinatorial algorithm for the problem with value of hop-parameter equal to three when values of...
متن کاملOptimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
Network design problems arise in a wide range of applied areas including telecommunications, computer networks, and transportation. In this paper, we address the following discrete capacitated multi-terminal network design problem. Given a connected digraph G = (V,A), a set of L potential facilities to be installed on each arc, and a set ofKmulti-terminal (non-simultaneous) commodity flow requi...
متن کامل2-Commodity Integer Network Synthesis Problem
We consider the following 2-commodity, integer network synthesis problem: Given two n×n, non-negative, symmetric, integer-valued matrices R = (rij) and S = (sij) of minimum flow requirements of 2 different commodities, construct an undirected network G = [N,E, c] on node set N = {1, 2, . . . , n} with integer edge capacities {c(e) : e ∈ E}, such that: (i) for any two pairs (i, j) and (k, l), i ...
متن کامل